Computably Enumerable Sets and Quasi-Reducibility
نویسندگان
چکیده
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, 〈RQ,≤Q 〉, under this reducibility with the more familiar structure of the c.e. Turing degrees. In our final section, we use coding methods to show that the elementary theory of 〈RQ,≤Q 〉 is undecidable.
منابع مشابه
The computable Lipschitz degrees of computably enumerable sets are not dense
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both the relative randomness and the relative computational power of real numbers. This paper proves that the computable Lipschitz degrees of computably enumerable sets are not dense. An immediate corollary is that the Solo...
متن کاملDefinability, automorphisms, and dynamic properties of computably enumerable sets
We announce and explain recent results on the computably enumerable (c.e.) sets, especially their definability properties (as sets in the spirit of Cantor), their automorphisms (in the spirit of FelixKlein’sErlanger Programm), their dynamic properties, expressed in terms of how quickly elements enter them relative to elements entering other sets, and theMartin Invariance Conjecture on their Tur...
متن کاملEvery incomplete computably enumerable truth-table degree is branching
If r is a reducibility between sets of numbers, a natural question to ask about the structure Cr of the r-degrees containing computably enumerable sets is whether every element not equal to the greatest one is branching (i.e., the meet of two elements strictly above it). For the commonly studied reducibilities, the answer to this question is known except for the case of truth-table (tt) reducib...
متن کاملStrongly Bounded Turing Reducibilities and Computably Enumerable Sets
Preface In this course we survey some recent work on the strongly bounded Turing re-ducibilities on the computably enumerable sets. Bounded Turing reducibilities are obtained from classical Turing reducibility by imposing upper bounds on the use functions (i.e., on the size of the oracle queries) of the reductions. The most popular bounded Turing reducibility which has been intensively studied ...
متن کاملNon-isolated quasi-degrees
A set A ⊆ ω is called 2-computably enumerable (2-c.e.), if there are computably enumerable sets A1 and A2 such that A1 −A2 = A. A set A ⊆ ω is quasi-reducible to a set B ⊆ ω (A ≤Q B), if there is a computable function g such that for all x ∈ ω we have x ∈ A if and only if Wg(x) ⊆ B. This reducibility was introduced by Tennenbaum (see [1], p.207) as an example of a reducibility which differs fro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 95 شماره
صفحات -
تاریخ انتشار 1998